formal grammar

formal grammar
формальная грамматика
метод математического описания синтаксиса языков программирования. Наум Хомски (Noam Chomsky) разделил формальные грамматики на четыре класса: грамматики общего вида (unrestricted grammar), контекстно-зависимые (context-sensitive grammar, CSG), контекстно-свободные (context-free grammar, CFG) и регулярные грамматики (regular grammar). Теория формальных грамматик стала составной частью математической лингвистики. Она изучает способы описания закономерностей, которые характеризуют всю совокупность правильных текстов того или иного языка

Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.

Игры ⚽ Поможем написать курсовую

Смотреть что такое "formal grammar" в других словарях:

  • Formal grammar — In formal semantics, computer science and linguistics, a formal grammar (also called formation rules) is a precise description of a formal language ndash; that is, of a set of strings over some alphabet. In other words, a grammar describes which… …   Wikipedia

  • formal grammar — noun A precise mathematical description of a formal language, consisting of terminal symbols, nonterminal symbols, a nonterminal symbol serving as start symbol, and a set of production rules that control the expansion of nonterminal symbols into… …   Wiktionary

  • Formal system — In formal logic, a formal system (also called a logical system,Audi, Robert (Editor). The Cambridge Dictionary of Philosophy . Second edition, Cambridge University Press, 1999. ISBN 978 0521631365 (hardcover) and ISBN 978 0521637220 (paperback).] …   Wikipedia

  • Formal language — A formal language is a set of words , i.e. finite strings of letters , or symbols . The inventory from which these letters are taken is called the alphabet over which the language is defined. A formal language is often defined by means of a… …   Wikipedia

  • Formal proof — See also: mathematical proof, proof theory, and axiomatic system A formal proof or derivation is a finite sequence of sentences (called well formed formulas in the case of a formal language) each of which is an axiom or follows from the… …   Wikipedia

  • Grammar induction — Grammatical induction, also known as grammatical inference or syntactic pattern recognition, refers to the process in machine learning of inducing a formal grammar (usually in the form of re write rules or productions ) from a set of observations …   Wikipedia

  • Grammar checker — In computing terms, a grammar checker is a program, or part of a program, that attempts to verify written text for grammatical correctness. Grammar checkers are most often implemented as a feature of a larger application, such as a word processor …   Wikipedia

  • Formal — The term formal has a number of uses, including:General*relating to formality *opposite of informalocial* Formal occasion ** Formal attire worn on such occasions ** Formals are particular meals at some British universities ** In Australian or… …   Wikipedia

  • Grammar school — A grammar school is one of several different types of school in the history of education in the United Kingdom and other English speaking countries.In the modern United States, the term is synonymous with elementary school.The original purpose of …   Wikipedia

  • Grammar framework — In theoretical linguistics, the following fundamental approaches towards constructing grammar frameworks for natural languages are distinguished:*Generative grammar: algorithmic (phrase structure grammars) **Transformational grammar (1960s)… …   Wikipedia

  • Formal interpretation — A formal interpretation [http://books.google.com/books?id=weKqT3ka5g0C pg=PA74 lpg=PA74 dq=%22Formal+interpretation%22+%22formal+language%22 source=web ots=pLN ms7Wi2 sig=P JqwdzOqLcX4nMpP64qmacnkDU hl=en#PPA74,M1 Cann Ronnie, Formal Semantics:… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»